A First Look at Propositional Logic
نویسنده
چکیده
There are many reasons why a computer scientist should study logic. For example, logic underlies the reasoning in mathematical statements. In particular, proving that a program meets its specification is argued with the help of logical deductions. We begin by studying propositional logic, which is one of the simplest logical theories. Nevertheless, propositional logic has a large number of applications; in particular, it provides the foundation for combinatorial circuits which implement the arithmetic logic unit of a processor. A nice property of propositional logic is that the truth of the statements formulated in this logic can be checked in a simple way by a computer. Surprisingly, propositional logic leads to the most intriguing open problem in computer science.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Note on Axiomatisations of Two-Dimensional Modal Logics
We analyse the role of the modal axiom corresponding to the first-order formula “∃y (x = y)” in axiomatisations of two-dimensional propositional modal logics. One of the several possible connections between propositional multi-modal logics and classical first-order logic is to consider finite variable fragments of the latter as ‘multi-dimensional’ modal formalisms: First-order variable-assignme...
متن کاملFinitely unstable theories and computational complexity
The complexity class NP can be logically characterized both through existential second order logic SO∃, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook. Both theorems involve encoding a Turing machine by a formula in the corresponding logic and stating that a model of this formula exists if and only if the ...
متن کاملThe Core Method: Connectionist Model Generation for First-Order Logic Programs
Research into the processing of symbolic knowledge by means of connectionist networks aims at systems which combine the declarative nature of logicbased artificial intelligence with the robustness and trainability of artificial neural networks. This endeavour has been addressed quite successfully in the past for propositional knowledge representation and reasoning tasks. However, as soon as the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008